Full-parallel architecture for turbo decoding of product codes
نویسندگان
چکیده
A full-parallel architecture for turbo decoding, which achieves ultrahigh data rates when using product codes as error correcting codes, is proposed. This architecture is able to decode product codes using binary BCH or m-ary Reed-Solomon component codes. The major advantage of our architecture is that it enables the memory blocks between all half-iterations to be removed. Moreover, the latency of the turbo decoder is strongly reduced. The proposed architecture opens the way to numerous applications such as optical transmission and data storage. In particular, the block turbo decoding architecture can support optical transmission at data rates above 10 Gbit=s.
منابع مشابه
Architecture de turbo-décodeur en blocs entièrement parallèle pour la transmission de données au-delà du Gbit/s
Mots clés : Code correcteur d'erreurs, Turbocodes en blocs, Décodage entièrement parallèle, Architecture à très haut débit. Abstract This paper presents a new circuit architecture for turbo decoding, which achieves ultra high data rates when using product codes as error correcting codes. This architecture is able to decode product codes using binary BCH or m-ary Reed Solomon component codes. Th...
متن کاملOn the higher ef ciency of parallel Reed-Solomon turbo-decoding
In this paper, we demonstrate the higher hardware ef ciency of Reed-Solomon (RS) parallel turbo decoding compared with BCH parallel turbo decoding. Based on an innovative architecture, this is the rst implementation of fully parallel RS turbo decoder. A performance analysis is performed showing that RS Block Turbo Codes (RS-BTC) have decoding performance equivalent to Bose Ray-Chaudhuri Hocque...
متن کاملIterative Least-Squares Decoding of Analog Product Codes
We define analog product codes as a special case of analog parallel concatenated codes. These codes serve as a tool to get some more insight into the convergence of “Turbo” decoding. We prove that the iterative “Turbo”-like decoding of analog product codes indeed is an estimation in the least-squares sense and thus correspond to the optimum maximum-likelihood decoding.
متن کاملOn Multiple Slice Turbo Codes
The main problem concerning the hardware implementation of turbo codes is the lack of parallelism in the MAP-based decoding algorithm. This paper proposes to overcome this problem with a new family of turbo codes, named Slice Turbo Codes. This family is based on two ideas: the encoding of each dimension with P independent tail-biting codes and a constrained interleaver structure that allows par...
متن کاملIterative Decoding of Concatenated Codes: A Tutorial
The turbo decoding algorithm of a decade ago constituted a milestone in error-correction coding for digital communications, and has inspired extensions to generalized receiver topologies, including turbo equalization, turbo synchronization, and turbo CDMA, among others. Despite an accrued understanding of iterative decoding over the years, the “turbo principle” remains elusive to master analyti...
متن کامل